Parameterized Structure-Preserving Transformations of Matrix Polynomials
نویسندگان
چکیده
منابع مشابه
Deflating Quadratic Matrix Polynomials with Structure Preserving Transformations
Given a pair of distinct eigenvalues (λ1, λ2) of an n×n quadratic matrix polynomial Q(λ) with nonsingular leading coefficient and their corresponding eigenvectors, we show how to transform Q(λ) into a quadratic of the form [ Qd(λ) 0 0 q(λ) ] having the same eigenvalues as Q(λ), with Qd(λ) an (n− 1)× (n− 1) quadratic matrix polynomial and q(λ) a scalar quadratic polynomial with roots λ1 and λ2. ...
متن کاملRoot Preserving Transformations of Polynomials
Consider the real vector space P2 of all polynomials of degree at most 2. High-school students study the roots of the polynomials in P2, while linear algebra students study linear transformations on P2. Is it possible to bring these two groups together to do some joint research? For example, a linear algebra student chooses a specific linear transformation T : P2 → P2 and asks others to study t...
متن کاملParameterized Approximation via Fidelity Preserving Transformations
Wemotivate and describe a new parameterized approximation paradigm which studies the interaction between performance ratio and running time for any parameterization of a given optimization problem. As a key tool, we introduce the concept of α-shrinking transformation, for α ≥ 1. Applying such transformation to a parameterized problem instance decreases the parameter value, while preserving appr...
متن کاملStructure-Preserving Transformations of Skew-Hamiltonian/Hamiltonian Matrix Pencils
ityl or positive realness in a VLSI model is an important property Passivity in a VLSI model is an important property to guarantee stato guarantee stable global simulation [3,7]. Existing DS passivity ble global simulation. Most VLSI models are naturally described tests are restrnctive in different aspects. For example, the extended as descriptor systems (DSs) or singular state spaces. Passivit...
متن کاملVerifying Parameterized Recursive Circuits Using Semantics-preserving Transformations of Nets Verifying Parameterized Recursive Circuits Using Semantics-preserving Transformations of Nets
This report will present a theorem-proving method for verifying parametrized recursive circuits. The method is based on semantics-preserving transformations of nets (SPTNs). Its theoretical bases are an algebraic calculus introduced by G. Hotz in 1965 and the hardware description language 2dL based on this calculus. The starting point of our method is a high-level description using bi-category ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2020
ISSN: 1081-3810
DOI: 10.13001/ela.2020.4963